Asynchronous automata and asynchronous languages
نویسندگان
چکیده
منابع مشابه
Languages of Infinite Traces and Deterministic Asynchronous Automata
In the theory of deterministic automata for languages of infinite words, a fundamental fact relates the family of infinitary limits of regular languages and the family of ω-languages recognized by deterministic Büchi automata. With the known definitions of asynchronous automata, this observation does not extend to the context of traces. A major difficulty is posed by processes that stall after ...
متن کاملImplementing Realistic Asynchronous Automata
Zielonka’s theorem, established 25 years ago, states that any regular language closed under commutation is the language of an asynchronous automaton (a tuple of automata, one per process, exchanging information when performing common actions). Since then, constructing asynchronous automata has been simplified and improved [6, 20, 7, 12, 8, 4, 2, 21, 22]. We first survey these constructions and ...
متن کاملAsynchronous cellular learning automata
Cellular learning automata is a combination of cellular automata and learning automata. The synchronous version of cellular learning automata in which all learning automata in different cells are activated synchronously, has found many applications. In some applications a type of cellular learning automata in which learning automata in different cells are activated asynchronously (asynchronous ...
متن کاملAsynchronous logic automata
Numerous applications, from high-performance scientific computing to large, highresolution multi-touch interfaces to strong artifical intelligence, push the practical physical limits of modern computers. Typical computers attempt to hide the physics as much as possible, running software composed of a series of instructions drawn from an arbitrary set to be executed upon data that can be accesse...
متن کاملDistributed Asynchronous Automata
Asynchronous automata are a model of communication processes with a distributed control structure, global initializations and global accepting conditions. The well-known theorem of Zielonka states that they recognize exactly the class of regular Mazurkiewicz trace languages. In this paper we study the particular case of distributed asynchronous automata, which require that the initializations a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1974
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(74)80052-5